Random sampling and approximation of MAX-CSPs

Approximation Algorithm for Random MAX-kSAT

We provide a rigorous analysis of a greedy approximation algorithm for the maximum random k-SAT (MAX-R-kSAT) problem. The algorithm assigns variables one at a time in a predefined order. A variable is assigned TRUE if it occurs more often positively than negatively; otherwise, it is assigned FALSE. After each variable assignment, problem instance is simplified and a new variable is selected. We...

Approximating Dense Max 2-CSPs

In this paper, we present a polynomial-time algorithm that approximates sufficiently high-value Max 2-CSPs on sufficiently dense graphs to within O(Nε) approximation ratio for any constant ε > 0. Using this algorithm, we also achieve similar results for free games, projection games on sufficiently dense random graphs, and the Densest k-Subgraph problem with sufficiently dense optimal solution. ...

Advanced Approximation Algorithms ( CMU 15 - 854 B , Spring 2008 ) Lecture 25 : Hardness of Max - k CSPs and Max - Independent - Set

Recall that an instance of the Max-kCSP problem is a collection of constraints, each of which is defined over k variables. A random assignment to the variables in a constraint satisfies it with probability 1/2, so a random assignment satisfies a 1/2 fraction of the constraints in a Max-kCSP instance in expectation. This shows that the hardness result is close to optimal, since there is a trivia...

Approximation Algorithms for CSPs

In this survey, we offer an overview of approximation algorithms for constraint satisfaction problems (CSPs) – we describe main results and discuss various techniques used for solving CSPs. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems

On Nontrivial Approximation of CSPs